Two lower bounds for the Stanley depth of monomial ideals

Let be two monomial ideals of the polynomial ring . In this paper, we provide two lower bounds for the Stanley depth of . On the one hand, we introduce the notion of lcm number of , denoted by , and prove that the inequality holds. On the other hand, we show that , where denotes the order dimension of the lcm lattice of . We show that I and satisfy Stanley's conjecture, if either the lcm number of I or the order dimension of the lcm lattice of I is small enough. Among other results, we also prove that the Stanley–Reisner ideal of a vertex decomposable simplicial complex satisfies Stanley's conjecture.     

New Lyapunov‐type inequalities for a class of even‐order linear differential equations

In this paper, we obtain some new Lyapunov‐type inequalities for a class of even‐order linear differential equations, the results are new and generalize and improve some early results in this field.     

Stochastic comparison of aggregate claim amounts between two heterogeneous portfolios and its applications

The aggregate claim amount in a particular time period is a quantity of fundamental importance for proper management of an insurance company and also for pricing of insurance coverages. In this paper, we show that the proportional hazard rates (PHR) model, which includes some well-known distributions such as exponential, Weibull and Pareto distributions, can be used as the aggregate claim amount distribution. We also present some conditions for the use of exponentiated Weibull distribution as the claim amount distribution. The results established here complete and extend the well-known result of Khaledi and Ahmadi (2008).     

On Landis’ Conjecture in the Plane

In this paper we prove a quantitative form of Landis’ conjecture in the plane. Precisely, let W(z) be a measurable real vector-valued function and V(z) ≥0 be a real measurable scalar function, satisfying ‖W‖ _{L ^∞(R ²)} ≤ 1 and ‖V‖ _{L ^∞(R ²)} ≤ 1. Let u be a real solution of Δu ? ?(Wu) ? Vu = 0 in R ². Assume that u(0) = 1 and |u(z)| ≤exp (C ₀|z|). Then u satisfies inf _{|z 0| =R}  sup _{|z?z 0| <1}|u(z)| ≥exp (?CRlog R), where C depends on C ₀. In addition to the case of the whole plane, we also establish a quantitative form of Landis’ conjecture defined in an exterior domain.     

On the concept and existence of solutions for fractional impulsive systems with Hadamard derivatives

In this paper, a class of nonlinear fractional order differential impulsive systems with Hadamard derivative is discussed. First, a reasonable concept on the solutions of fractional impulsive Cauchy problems with Hadamard derivative and the corresponding fractional integral equations are established. Second, two fundamental existence results are presented by using standard fixed point methods. Finally, two examples are given to illustrate our theoretical results.     

Asymptotically exact a posteriori local discontinuous Galerkin error estimates for the one‐dimensional second‐order wave equation

In this article, we analyze a residual‐based a posteriori error estimates of the spatial errors for the semidiscrete local discontinuous Galerkin (LDG) method applied to the one‐dimensional second‐order wave equation. These error estimates are computationally simple and are obtained by solving a local steady problem with no boundary condition on each element. We apply the optimal L² error estimates and the superconvergence results of Part I of this work [Baccouch, Numer Methods Partial Differential Equations 30 (2014), 862–901] to prove that, for smooth solutions, these a posteriori LDG error estimates for the solution and its spatial derivative, at a fixed time, converge to the true spatial errors in the L²‐norm under mesh refinement. The order of convergence is proved to be , when p‐degree piecewise polynomials with are used. As a consequence, we prove that the LDG method combined with the a posteriori error estimation procedure yields both accurate error estimates and superconvergent solutions. Our computational results show higher convergence rate. We further prove that the global effectivity indices, for both the solution and its derivative, in the L²‐norm converge to unity at rate while numerically they exhibit and rates, respectively. Numerical experiments are shown to validate the theoretical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1461–1491, 2015     

Interpolating minimal energy C1‐Surfaces on Powell–Sabin Triangulations: Application to the resolution of elliptic problems

In this article, we present a method to obtain a C¹‐surface, defined on a bounded polygonal domain Ω, which interpolates a specific dataset and minimizes a certain “energy functional.” The minimization space chosen is the one associated to the Powell–Sabin finite element, whose elements are C¹‐quadratic splines. We develop a general theoretical framework for that, and we consider two main applications of the theory. For both of them, we give convergence results, and we present some numerical and graphical examples. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 798–821, 2015     

Uniform point-wise error estimates of semi-implicit compact finite difference methods for the nonlinear Schrödinger equation perturbed by wave operator

This study is devoted to analysis of semi-implicit compact finite difference (SICFD) methods for the nonlinear Schrödinger equation (NLS) perturbed by the wave operator (NLSW) with a perturbation strength described by a dimensionless parameter ε∈(0,1]$\epsilon \in (0,1]$. Uniform l^∞$l^{\infty }$-norm error bounds of the proposed SICFD schemes are built to give immediate insight on point-wise error occurring as time increases, and the explicit dependence of the mesh size and time step on the parameter ε is also figured out. In the small ε   regime, highly oscillations arise in time with O(ε²)$O({\epsilon }^2)$-wavelength. This highly oscillatory nature in time as well as the difficulty raised by the compact FD discretization make establishing the l^∞$l^{\infty }$-norm error bounds uniformly in ε   of the SICFD methods for NLSW to be a very interesting and challenging issue. The uniform l^∞$l^{\infty }$-norm error bounds in ε   are proved to be of O(h⁴+τ)$O(h^4+\tau )$ and O(h⁴+τ^2/3)$O(h^4+{\tau }^{2/3})$ with time step τ and mesh size h for well-prepared and ill-prepared initial data. Finally, numerical results are reported to verify the error estimates and show the sharpness of the convergence rates in the respectively parameter regimes.     

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h‐multigrid and p‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.